Strategy-Proofness for Hospitals in Matching Markets
نویسنده
چکیده
Strategy-proof implementation is one of the many elements that have contributed to the successful application of matching theory in real life. However, in many-to-one matching markets without transfers (e.g., doctors to hospitals with fixed salaries) there is no stable mechanism which is strategy-proof for hospitals. Furthermore, strategy-proofness and stability cannot be achieved for both hospitals and doctors simultaneously even in one-to-one matching markets. This paper shows that in many-to-one matching markets with transfers it is possible to guarantee stability and strategy-proofness-for-hospitals whenever an opportunity cost condition is satisfied. In addition, it is shown that stability and strategy-proofness are possible for both hospitals and doctors simultaneously . Finally, it is shown that strategy-proofness can be achieved in the interior of the core. JEL classification: C62; C71; C78; D47.
منابع مشابه
The blocking lemma and group incentive compatibility for matching with contracts
This paper considers a general class of two-sided many-to-one matching markets, so-called matching markets with contracts. We study the blocking lemma and group incentive compatibility for this class of matching markets. We first show that the blocking lemma for matching with contracts holds if hospitals’ choice functions satisfy substitutes and the law of aggregate demand. The blocking lemma f...
متن کاملContract Design and Stability in Matching Markets
We develop a model of many-to-many matching with contracts which subsumes as special cases many-to-many matching markets and buyer-seller markets with heterogeneous and indivisible goods. In our setting, in contrast to results for the setting of many-to-one matching with contracts, preference substitutability is sufficient and necessary to guarantee the existence of a nonempty lattice of stable...
متن کاملStrategy-Proofness in the Stable Matching Problem with Couples
Stable matching problems (SMPs) arising in real-world markets often have extra complementarities in the participants’ preferences. These complementarities break many of the theoretical properties of SMP and make it computationally hard to find a stable matching. A common complementarity is the introduction of couples in labor markets, which gives rise to the stable matching problem with couples...
متن کاملStable matching mechanisms are not obviously strategy-proof
Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a growing amount of empirical evidence reveals that applicants misrepresent their preferences when this mechanism is used. This paper shows that no mechanism th...
متن کاملGames with capacity manipulation: incentives and Nash equilibria
Studying the interaction between preference and capacity manipulation in matching markets, we prove that acyclicity is a necessary and sufficient condition that guarantees the stability of a Nash equilibrium and the strategy-proofness of truthful capacity revelation under the hospital-optimal and intern-optimal stable rules. We then introduce generalized capacity manipulations games where hospi...
متن کامل